Analysis of Incomplete Circuits using Dependency Quantified Boolean Formulas
نویسندگان
چکیده
We consider Dependency Quantified Boolean Formulas (DQBFs), a generalization of Quantified Boolean Formulas (QBFs), and demonstrate that DQBFs are a natural calculus to exactly express the realizability problem of incomplete combinational and sequential circuits with an arbitrary number of (combinational or bounded-memory) black boxes. In contrast to usual approaches for controller synthesis, restrictions to the interfaces of missing circuit parts in distributed architectures are strictly taken into account. We present a solution method for DQBFs together with the extraction of Skolem functions for existential variables, which can directly serve as implementations for the black boxes. First experimental results are provided.
منابع مشابه
Fast DQBF Refutation
Dependency Quantified Boolean Formulas (DQBF) extend QBF with Henkin quantifiers, which allow for non-linear dependencies between the quantified variables. This extension is useful in verification problems for incomplete designs, such as the partial equivalence checking (PEC) problem, where a partial circuit, with some parts left open as “black boxes”, is compared against a full circuit. The PE...
متن کاملDependency Quantified Horn Formulas: Models and Complexity
Dependency quantified Boolean formulas (DQBF ) extend quantified Boolean formulas with Henkin-style partially ordered quantifiers. It has been shown that this is likely to yield more succinct representations at the price of a computational blow-up from PSPACE to NEXPTIME. In this paper, we consider dependency quantified Horn formulas (DQHORN ), a subclass of DQBF, and show that the computationa...
متن کاملExpressiveness and Complexity of Subclasses of Quantified Boolean Formulas
We give a brief overview of expressiveness and complexity results for a hierarchy of subclasses of quantified Boolean formulas with close connections to Boolean circuits and minimal unsatisfiability.
متن کاملTransformations into Normal Forms for Quantified Circuits
We consider the extension of Boolean circuits to quantified Boolean circuits by adding universal and existential quantifier nodes with semantics adopted from quantified Boolean formulas (QBF). The concept allows not only prenex representations of the form ∀x1∃y1...∀xn∃yn c where c is an ordinary Boolean circuit with inputs x1, ..., xn, y1, ..., yn. We also consider more general non-prenex norma...
متن کاملResolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
We present an extension of Q-Unit resolution for formulas that are not completely in clausal form. This b-unit resolution is applied to different classes of quantified Boolean formulas in which the existential and universal variables satisfy the Horn property. These formulas are transformed into propositional equivalents consisting of only polynomially many subformulas. We obtain compact encodi...
متن کامل